- undecidable theory
- мат.неразрешимая теория
English-Russian scientific dictionary. 2008.
undecidable theory
Смотреть что такое "undecidable theory" в других словарях:
Undecidable — has more than one meaning:;In mathematical logic: * A decision problem is called (recursively) undecidable if no algorithm can decide it, such as for Turing s halting problem; see also under Decidable and Undecidable problem. * Undecidable is… … Wikipedia
Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any … Wikipedia
Theory of everything — A theory of everything (TOE) is a putative theory of theoretical physics that fully explains and links together all known physical phenomena. Initially, the term was used with an ironic connotation to refer to various overgeneralized theories.… … Wikipedia
Theory of computation — In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata… … Wikipedia
undecidable — adjective a) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are… … Wiktionary
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Computability theory (computer science) — In computer science, computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation.Computability theory differs from the related discipline of… … Wikipedia
On Formally Undecidable Propositions of Principia Mathematica and Related Systems — This article describes the publication details of a famous paper in mathematical logic. For information about the theorems proved in this paper, see Gödel s incompleteness theorems. Über formal unentscheidbare Sätze der Principia Mathematica und… … Wikipedia
General set theory — (GST) is George Boolos s (1998) name for a three axiom fragment of the canonical axiomatic set theory Z. GST is sufficient for all mathematics not requiring infinite sets, and is the weakest known set theory whose theorems include the Peano… … Wikipedia
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … Wikipedia
